On (P5, diamond)-free graphs
نویسندگان
چکیده
We study the stability number, chromatic number and clique cover of graphs with no induced P5 and diamonds. In particular, we provide a way to obtain all imperfect (P5, diamond)-free graphs by iterated point multiplication or substitution from a /nite collection of small basic graphs. Corollaries of this and other structural properties, among which a result of Bacs1 o and Tuza, are (i) combinatorial algorithms to solve coloring, clique cover and stable set in the class of (P5, diamond)-free graphs, (ii) a complete description of the stable set polytope of (P5, diamond)-free graphs, and (iii) the existence of non-trivial h-perfect graphs which are not t-perfect. c © 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Polynomial-time algorithms for minimum weighted colorings of ($P_5, \bar{P}_5$)-free graphs and related graph classes
We design an O(n) algorithm to find a minimum weighted coloring of a (P5, P 5)free graph. Furthermore, the same technique can be used to solve the same problem for several classes of graphs, defined by forbidden induced subgraphs, such as (diamond, co-diamond)-free graphs.
متن کاملPolynomial Cases for the Vertex Coloring Problem
The computational complexity of the Vertex Coloring problem is known for all hereditary classes of graphs defined by forbidding two connected five-vertex induced subgraphs, except for seven cases. We prove the polynomial-time solvability of four of these problems: for (P5, dart)-free graphs, (P5, banner)-free graphs, (P5, bull)-free graphs, and (fork, bull)-free graphs.
متن کاملOn mirror nodes in graphs without long induced paths
The notion of mirror nodes, first introduced by Fomin, Grandoni and Kratsch in 2006, turned out to be a useful item for their design of an algorithm for the maximum independent set problem (MIS). Given two nodes u, v of a graph G = (V, E) with distG(u, v) = 2, u is called a mirror of v if N(v) \N(u) induces a (possibly empty) clique. In order to have a well defined term, we add that every compl...
متن کاملIndependent Set in P5-Free Graphs in Polynomial Time
The Independent Set problem is NP-hard in general, however polynomial time algorithms exist for the problem on various specific graph classes. Over the last couple of decades there has been a long sequence of papers exploring the boundary between the NPhard and polynomial time solvable cases. In particular the complexity of Independent Set on P5-free graphs has received significant attention, a...
متن کاملOn algorithms for (P5, gem)-free graphs
A graph is (P5,gem)-free, when it does not contain P5 (an induced path with five vertices) or a gem (a graph formed by making an universal vertex adjacent to each of the four vertices of the induced path P4) as an induced subgraph. We present O(n2) time recognition algorithms for chordal gem-free and for (P5,gem)free graphs. Using a characterization of (P5,gem)-free graphs by their prime graphs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 250 شماره
صفحات -
تاریخ انتشار 2002